Papers with relation embedding
A Hierarchical N-Gram Framework for Zero-Shot Link Prediction (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to zero-shot link prediction use textual features of relations as auxiliary information to improve the encoded representation. |
| Approach: | They propose a Hierarchical N-gram framework for Zero-Shot Link Prediction that leverages character n-gram information for ZSLP. |
| Outcome: | The proposed method achieves state-of-the-art on two standard ZSLP datasets. |
Consistent Representation Learning for Continual Relation Extraction (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to train relation extraction models overfit memory samples and perform poorly on imbalanced datasets. |
| Approach: | They propose a method which uses contrastive learning and knowledge distillation to train a model on data with new relations while avoiding forgetting old ones. |
| Outcome: | The proposed method significantly outperforms state-of-the-art baselines and yields strong robustness on the imbalanced datasets. |
Improving Latent Alignment in Text Summarization by Generalizing the Pointer Generator (D19-1)
Copied to clipboard
| Challenge: | Modern pointer generators only capture exact word matches, ignoring possible inflections or abstractions, which restricts its power of capturing richer latent alignment. |
| Approach: | They propose a pointer generator architecture that allows the model to "edit" pointed tokens instead of always copying them. |
| Outcome: | The proposed model captures more latent alignment relations than exact word matches and generates higher-quality summaries validated by both qualitative and quantitative evaluations. |
Learning Representation Mapping for Relation Detection in Knowledge Base Question Answering (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to detect relation detection only get high accuracy for questions whose relations have been seen in training data. |
| Approach: | They propose a method to learn representation mapping for both seen and unseen relations based on previously learned relation embedding. |
| Outcome: | The proposed method improves the performance of unseen relations while keeping the performance comparable to the state-of-the-art. |
Knowledge GeoGebra: Leveraging Geometry of Relation Embeddings in Knowledge Graph Completion (2024.lrec-main)
Copied to clipboard
| Challenge: | Knowledge graph embedding models are limited to the algebra and geometry of the entity embeddable space, the algebra of the relation embeddible space, and the interaction between relation and entity embeds. |
| Approach: | They propose a method that leverages the geometry of relation embeddings and generalizes it with the concept of a butterfly curve, consecutively. |
| Outcome: | The proposed model outperforms existing models on the WN18RR, FB15K-237 and YouTube benchmarks. |